Parallel Minimum Spanning Tree Algorithm
نویسنده
چکیده
The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in order to achieve a high level of parallelism. We also analyze the parallel time complexity of this algorithm and the experimental results demonstrate it is a good time bound. In the last part of the paper, we use different methods to test and verify our implementation, including directly testing and model checking using Java PathFinder.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملAn Optimal EREW PRAM Algorithm For Minimum Spanning Tree Veri cation
We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(logn) time and O(m+ n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the problem.
متن کاملSimple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
Two simple and work e cient parallel algorithms for the minimum spanning tree problem are presented Both algorithms perform O m log n work The rst algorithm runs in O log n time on an EREW PRAM while the second algorithm runs in O logn time on a Common CRCW PRAM
متن کاملA New Parallel Algorithm for Computing Minimum Spanning Tree
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected weighted graph with n vertices and m edges. This algorithm uses the cluster techniques to reduce the number of processors by fraction 1/ ( ) f n and the parallel work by the fraction O ( 1 l...
متن کاملSimple parallel algorithms for the replacement edge problem and related problems on spanning trees
Let G be a connected, undirected, and weighted graph with n vertices and m edges. Further, let S be a spanning tree of G and T a minimum spanning tree of G. In this paper we present parallel algorithms for solving the following problems: (a) Given G and T , for each edge e of T , determine a replacement edge f by which e should be replaced to create a new minimum spanning tree if e is removed f...
متن کاملAn Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees
We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We also provide a comparative performance analysis of our algorithm with other related ones which demonstrates the general superiority of this parallel algorithm over other competing algorithms in terms of accuracy and s...
متن کامل